Restricted Structural Random Matrix for compressive sensing
نویسندگان
چکیده
Compressive sensing (CS) is well-known for its unique functionalities of sensing, compressing, and security (i.e. equal importance CS measurements). However, there a tradeoff. Improving compressing efficiency with prior signal information tends to favour particular measurements, thus decreasing security. This work aimed improve the without compromising novel sampling matrix, named Restricted Structural Random Matrix (RSRM). RSRM unified advantages frame-based block-based together global smoothness low-resolution signals are highly correlated). acquired compressive measurements random projection multiple randomly sub-sampled signals, which was restricted (equal in energy), thereby observations equally important. proven satisfy Isometry Property showed comparable reconstruction performance recent state-of-the-art deep learning-based methods. • Propose matrix that improves scarifying democracy. Combine partial sampling, multi-images super-resolution, coded imaging, sensing. Proposed satisfies competitive performance.
منابع مشابه
Compressive Sensing by Random Convolution
This paper demonstrates that convolution with random waveform followed by random time-domain subsampling is a universally efficient compressive sensing strategy. We show that an n-dimensional signal which is S-sparse in any fixed orthonormal representation can be recovered from m & S log n samples from its convolution with a pulse whose Fourier transform has unit magnitude and random phase at a...
متن کاملOptimized Projection Matrix for Compressive Sensing
Compressive sensing (CS) is mainly concerned with low-coherence pairs, since the number of samples needed to recover the signal is proportional to the mutual coherence between projection matrix and sparsifying matrix. Until now, papers on CS always assume the projection matrix to be a random matrix. In this paper, aiming at minimizing the mutual coherence, a method is proposed to optimize the p...
متن کاملRestricted isometry properties and nonconvex compressive sensing
In previous work, numerical experiments showed that ` minimization with 0 < p < 1 recovers sparse signals from fewer linear measurements than does ` minimization. It was also shown that a weaker restricted isometry property is sufficient to guarantee perfect recovery in the ` case. In this work, we generalize this result to an ` variant of the restricted isometry property, and then determine ho...
متن کاملCompressive Sensing and Structured Random Matrices
These notes give a mathematical introduction to compressive sensing focusing on recovery using `1-minimization and structured random matrices. An emphasis is put on techniques for proving probabilistic estimates for condition numbers of structured random matrices. Estimates of this type are key to providing conditions that ensure exact or approximate recovery of sparse vectors using `1-minimiza...
متن کاملCompressive sensing by white random convolution
—A different compressive sensing framework, convolution with white noise waveform followed by subsampling at fixed (not randomly selected) locations, is studied in this paper. We show that its recoverability for sparse signals depends on the coherence (denoted by μ) between the signal representation and the Fourier basis. In particular, an n-dimensional signal which is S-sparse in such a basis ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Signal Processing-image Communication
سال: 2021
ISSN: ['1879-2677', '0923-5965']
DOI: https://doi.org/10.1016/j.image.2020.116017